搜索资源列表
有限自动机的确定化
- 此程序可以把编译原理中的不确定的有限自动机确定化,是编译中课程设计的内容-this program can build on the principle of uncertainty to determine finite automata, which is to compile the contents of the curriculum design
DFAv1
- 关于有穷自动机和正则表达式相互转化的程序,并完成有穷自动机的确定化和最小化。-on Finite Automata and Regular expressions are transformed into each other procedures, and complete the DFA and the determination of the smallest.
有限自动(编译原理)源代码机
- 有限自动机 是编译原理课程设计源代码 可以用来借鉴与参考,可以运行。-Finite Automata Theory courses is to compile the source code design can be used to make a reference, can run.
FAv1
- 使用C#编写,实现输入正则表达式,输出确定有限自动机,使用图形界面显示。-prepared to use C#, are realizing the importation of expression, to determine output finite automata, the use of a graphical interface shows.
A finite automata learning system using GP
- 遗传算法的文章- Heredity algorithm article
Automata
- creating a finite automata
Finite_Automata
- 介绍有限自动机原理的PPT,制作精良,推荐阅读-a PPT about Finite Automata
DFA
- 简单DFA有穷自动机,可以根据输入的状态转换表,进行状态转换,对输入的字符串判断,该自动机是否可以接受。并有具体报告说明。-Simple DFA finite automata may be based on the input state transition table for state transitions, the input string to determine that the automatic machine is acceptable. And have specific
wybyyl
- 编译原理之词法识别 利用有限自动机识别词法 初始化保留字表和标示符表,识别非法字符-Compiler theory of lexical identification using finite automata recognize lexical reserved words table and initialize the table identifier to identify illegal characters
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词,如:标识符、数字、运算符,和if、while等保留字的确定有限自动机,并写出对应该自动机的程序;然后以一个简化的C语言程序为输入文件,通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表,并以文件形式保存结果(也就是TOKEN序列)。 将自己定义的各个正则表达式转化为NFA,然后将其综合为NFA ,再将NFA 转化为DFA,再将DFA转化为最少状态的DFA ,最后由DFA 转化为词法分析程序。-Manually constr
Finite-automata
- 基于有限自动机的词性标注方法,利用自动机进行状态转化,速度很快-Part of speech tagging method based on finite automata, automata for state transformation, very fast.
Compilation-of-finite-automata
- 编译原理实验程序集,无符号数的自动机实现,单词的识别,读取无符号数,无符号数的有穷自动机-Compiler principle experiment assembly, the automata of the symbol number, word recognition, reading unsigned unsigned finite automata
1finite-automata-weak-reversible
- 有限自动机的弱可逆的探讨 有限自动机的弱可逆的探讨-The finite automata weak reversible explore of finite automata weak reversible explore
3finite-automata-weak-reversible
- 输入存贮线性有限自动机的弱可逆性 输入存贮线性有限自动机的弱可逆性-Weak reversibility of the input memory linear finite automata weak reversible input memory linear finite automata
2finite-automata-weak-reversible
- 有限自动机的积可逆性讨论 有限自动机的积可逆性讨论-finite automata weak reversible finite automata weak reversible
uncertain-finite-automata-determine
- 不确定有限状态自动机的确定化,不确定有限状态自动机的确定化-The uncertain finite state automata determine
automata
- 自动机(用于识别输入字符串是否合乎规则,否则报错)-finite automata
automata
- 有限自动机的确定华,NFA到DFA的转变,很好的源码(The determination of finite automata China, NFA to DFA transformation, a good source)
Mazharul String Matching By Finite Automata
- Mazharul String Matching By Finite Automata